Optimal Metastability-Containing Sorting via Parallel Prefix Computation
نویسندگان
چکیده
منابع مشابه
Optimal Metastability-Containing Sorting Networks
When setup/hold times of bistable elements are violated, they may become metastable, i.e., enter a transient state that is neither digital 0 nor 1 [13]. In general, metastability cannot be avoided, a problem that manifests whenever taking discrete measurements of analog values. Metastability of the output then reflects uncertainty as to whether a measurement should be rounded up or down to the ...
متن کاملParallel Prefix Computation and Sorting on a Recursive Dual-Net
In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net RDN(B) for k > 0 has (2no)/2 nodes and d0 + k links per node, where n0 and d0 are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of ...
متن کاملComputation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملProbabilistic Parallel Prefix Computation
Given inputs ~1,. . . , z,,, which are independent identically distributed random variables over a domain D, and an associative operation o, the probabilistic prej?x computation problem is to compute the product ~1 o x2 o . . . o xn and its n 1 prefixes. Instances of this problem are finite state transductions on random inputs, the addition or subtraction of two random n-bit binary numbers, and...
متن کاملNon-Associative Parallel Prefix Computation
Chen, R.-J. and Y.-S. Hou, Non-associative parallel prefix computation, Information Processing Letters 44 (1992) 91-94. Associativity of a binary operation allows many applications that are not possible with a non-associative binary operation. We propose a method to transform a binary expression into an associative one and present two related applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2020
ISSN: 0018-9340,1557-9956,2326-3814
DOI: 10.1109/tc.2019.2939818